The I2C-bus in discrete-time process algebra
نویسندگان
چکیده
منابع مشابه
The I 2 C - bus in Discrete - Time Process Algebra
Using discrete time process algebra with relative timing, a model for the I 2 C-bus is designed. The model of the I 2 C-bus is divided in three parts: a model for the bus lines, a model for the master interfaces and a model for the slave interfaces. The model of the bus lines is based on a model for a wired-AND. For the models of the interfaces, the approach is to start from a high level bus pr...
متن کاملThe I²C-Bus in Discrete-Time Process Algebra
Using discrete time process algebra with relative timing, a model for the I 2 C-bus is designed. The model of the I 2 C-bus is divided in three parts: a model for the bus lines, a model for the master interfaces and a model for the slave interfaces. The model of the bus lines is based on a model for a wired-AND. For the models of the interfaces, the approach is to start from a high level bus pr...
متن کاملDiscrete-Time Process Algebra with Empty Process
We introduce an ACP-style discrete-time process algebra with relative timing, that features the empty process. Extensions to this algebra are described, and ample attention is paid to the considerations and problems that arise when introducing the empty process. We prove time determinacy, soundness, completeness, and the axioms of standard concurrency. 1991 Mathematics Subject Classification: 6...
متن کاملCompleteness in Discrete-Time Process Algebra
We prove soundness and completeness for some ACP-style concrete, relative-time, discrete-time process algebras. We treat non-delayable actions, delayable actions, and immediate deadlock. Basic process algebras are examined extensively, and also some concurrent process algebras are considered. We conclude with ACPdrt, which combines all described features in one theory. 1991 Mathematics Subject ...
متن کاملDiscrete time process algebra with silent step
Abstract The axiom system ACP of [10] was extended to discrete time in [6]. Here, we proceed to define the silent step in this theory in branching bisimulation semantics [7, 15] rather than weak bisimulation semantics [11, 20]. The version using relative timing is discussed extensively, versions using absolute and parametric timing are presented in brief. A term model and a graph model are pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1997
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(96)00036-6